Logical separation and accessing of descriptor memories

ABSTRACT

A packet header processing engine includes a memory having a number of distinct portions for respectively storing different types of descriptor information for a header of a packet. A packet header processing unit includes a number of pointers corresponding to the number of distinct memory portions. The packet header processing unit is configured to retrieve the different types of descriptor information from the number of distinct memory portions and to generate header information from the different types of descriptor information.

RELATED APPLICATIONS

This application is related to six concurrently-filed applications(attorney docket nos. 0023-0063, 0023-0064, 023-0065, 023-0066,023-0067, and 0023-0069), Ser. Nos. ______, ______, ______, ______,______, and ______, respectively.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The principles of the invention relate generally to high performancenetwork routers, and more particularly, to the processing of networkinformation in a high performance router.

2. Description of Related Art

Routers receive data on a physical media, such as optical fiber, analyzethe data to determine its destination, and output the data on a physicalmedia in accordance with the destination. Routers were initiallydesigned using a general purpose processor executing large softwareprograms. As line rates and traffic volume increased, however, generalpurpose processors could not scale to meet these new demands. Forexample, as functionality was added to the software, such as accountingand policing functionality, these routers suffered performancedegradation. In some instances, the routers failed to handle traffic atline rate when the new functionality was turned on.

To meet the new demands, purpose-built routers were designed withcomponents optimized for routing. They not only handle higher line ratesand higher network traffic volume, they also add functionality withoutcompromising line rate performance.

A purpose-built router may include a number of input and output portsfrom which it transmits and receives information packets. A packetreceived at one port is directed to its appropriate output port based onan examination and processing of the packet's header information, whichincludes an indication of the packet's destination. A high-performancerouter must accordingly examine and process the header information at ahigh speed.

Thus, it is desirable to improve the speed and efficiency of packetheader processing in high-performance routers.

SUMMARY OF THE INVENTION

Systems and methods consistent with the principles of the invention,among other things, provide for improved memory access within a packetheader processing engine.

In accordance with one purpose of the invention as embodied and broadlydescribed herein, a packet header processing engine may include atemplate memory configured to store template data and a tag descriptormemory configured to store tag descriptor data. The engine may alsoinclude a level x (Lx) descriptor memory configured to store Lxdescriptor data. An Lx header execution unit may be connected to thetemplate memory, the tag descriptor memory, and the Lx descriptormemory. The Lx header execution unit may be configured to construct anLx header from at least one of the template data, the tag descriptordata, and the Lx descriptor data.

In another implementation consistent with the principles of theinvention, a packet header processing engine may include a memoryconfigured to store at least one of template data, tag descriptor data,and level 2 (L2) descriptor data as continuous portions of the memory. Apacket processing unit may be connected to the memory. The packetprocessing unit may be configured to construct packet header informationaccording to a packet header protocol from the at least one of thetemplate data, the tag descriptor data, and the L2 descriptor data.

In a further implementation consistent with the principles of theinvention, a method may include reading descriptor data from a memoryand incrementing at least one pointer to the descriptor data in thememory upon the reading. Packet header information may be constructedfrom the descriptor data according to a packet header protocol.

In yet another implementation consistent with the principles of theinvention, a network device for processing packets may include a bufferconfigured to store the packets, including header data and payload datafor the packets. A descriptor reader component may be coupled to thebuffer. The descriptor reader component may be configured to receive theheader data for the packets stored in the buffer and configured to lookup descriptor information relating to the received packet header data. Amemory may be coupled to the descriptor reader component. The memory mayinclude a number of distinct portions for receiving the descriptorinformation from the descriptor reader component. A packet headerprocessing unit may be coupled to the descriptor reader component andmay include a number of pointers corresponding to the number of distinctmemory portions. The packet header processing unit may be configured toreceive the packet header data from the descriptor reader component andthe descriptor information from the number of distinct memory portions.

In a further implementation consistent with the principles of theinvention, a packet header processing engine may include a memory havinga number of distinct portions for respectively storing different typesof descriptor information for a header of a packet. A packet headerprocessing unit may include a number of pointers corresponding to thenumber of distinct memory portions. The packet header processing unitmay be configured to retrieve the different types of descriptorinformation from the number of distinct memory portions and to generateheader information from the different types of descriptor information.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute apart of this specification, illustrate an embodiment of the inventionand, together with the description, explain the invention. In thedrawings,

FIG. 1 is a block diagram illustrating an exemplary routing system inwhich principles consistent with the invention may be implemented;

FIG. 2 is an exemplary detailed block diagram illustrating portions ofthe routing system shown in FIG. 1;

FIG. 3 is a diagram illustrating portions of FIG. 2 in additionaldetail;

FIG. 4 is a diagram illustrating components of a packet;

FIG. 5 is a diagram illustrating elements of the processing units shownin FIG. 3;

FIG. 6 is a diagram illustrating an L2/L3 engine component having sixparallel engines;

FIG. 7 is a diagram illustrating one of L2/L3 engines shown in FIG. 6;

FIG. 8 is a flow chart illustrating operation of the L2/L3 engines shownin FIGS. 6 and 7;

FIG. 9 is a diagram conceptually illustrating the loading and unloadingof data in the L2/L3 engines 602;

FIG. 10 is a diagram illustrating the operation of mailbox registers;

FIG. 11 is a diagram illustrating the L2 execution unit of FIG. 7 inadditional detail;

FIG. 12 is a diagram illustrating the L3 execution unit of FIG. 7 inadditional detail;

FIG. 13 is a diagram illustrating the descriptor memories of FIG. 7 inadditional detail;

FIG. 14 is a diagram illustrating checksum processing hardware inconjunction with the L3 execution unit of FIG. 7; and

FIG. 15 is a flow chart illustrating fragment handling by the L2/L3engine component of FIG. 5.

DETAILED DESCRIPTION

The following detailed description of the invention refers to theaccompanying drawings. The same reference numbers may be used indifferent drawings to identify the same or similar elements. Also, thefollowing detailed description does not limit the invention. Instead,the scope of the invention is defined by the appended claims andequivalents of the claim limitations.

As described herein, a processing engine may include pointers to readdescriptor data from a single descriptor memory having logical portions.In one implementation, three pointers enable first-in, first-out (FIFO)behavior from three contiguous portions of the descriptor memory.

System Configuration

FIG. 1 is a block diagram illustrating an exemplary routing system 100in which the present invention may be implemented. System 100 receives adata stream from a physical link, processes the data stream to determinedestination information, and transmits the data stream out on a link inaccordance with the destination information. System 100 may includepacket forwarding engines (PFEs) 110, a switch fabric 120, and a routingengine (RE) 130.

RE 130 performs high level management functions for system 100. Forexample, RE 130 communicates with other networks and systems connectedto system 100 to exchange information regarding network topology. RE 130creates routing tables based on network topology information, createsforwarding tables based on the routing tables, and forwards theforwarding tables to PFEs 110. PFEs 110 use the forwarding tables toperform route lookup for incoming packets. RE 130 also performs othergeneral control and monitoring functions for system 100.

PFEs 110 are each connected to RE 130 and switch fabric 120. PFEs 110receive data at ports on physical links connected to a network, such asa wide area network (WAN), a local area network (LAN), or a device. Eachphysical link could be one of many types of transport media, such asoptical fiber or Ethernet cable. The data on the physical link isformatted according to one of several protocols, such as the synchronousoptical network (SONET) standard or Ethernet.

PFE 110 processes incoming data by stripping off the data link layer.PFE 110 converts header information from the remaining data into datastructures referred to herein as “notifications” and “cells” (where acell is a fixed length data unit). For example, in one embodiment, thedata remaining after the data link layer is stripped off is packet data.PFE 110 includes the layer 2 (L2) and layer 3 (L3) packet headerinformation, some control information regarding the packets, and thepacket data in a series of cells called “D” cells. In one embodiment,the L2, L3, and the control information are stored in the first twocells of the series of cells.

In general, L2 header information refers to header information used tosteer packets within LANs. L3 header information, in contrast, providesconnectivity between different LANs. In this sense, the L3 headerinformation provides more general destination information than the L2header. An incoming packet may include both L2 and L3 headerinformation. Router 100 may modify the packet's L2 and L3 headerinformation before transmitting the packet to its next destination.

PFE 110 forms a notification based on the L2, L3, and controlinformation, and performs a route lookup using the notification and therouting table from RE 130 to determine destination information. PFE 110may also further process the notification to perform protocol-specificfunctions, policing, and accounting, and might even modify thenotification to form a new notification.

If the determined destination indicates that the packet should be sentout on a physical link connected to PFE 110, then PFE 110 retrieves thecells for the packet, converts the notification or new notification intoheader information, forms a packet using the packet data from the cellsand the header information, and transmits the packet from the portassociated with the physical link.

If the destination indicates that the packet should be sent to anotherPFE via switch fabric 120, then PFE 110 retrieves the cells for thepacket, modifies the first two cells with the new notification and newcontrol information, if necessary, and sends the cells to the other PFEvia switch fabric 120. Before transmitting the cells over switch fabric120, PFE 110 appends a sequence number to each cell, which allows thereceiving PFE to reconstruct the order of the transmitted cells.Additionally, the receiving PFE uses the notification to form a packetusing the packet data from the cells, and sends the packet out on theport associated with the appropriate physical link of the receiving PFE.

In summary, in one embodiment, RE 130, PFEs 110, and switch fabric 120perform routing based on packet-level processing. PFEs 110 store eachpacket in cells while performing a route lookup using a notification,which is based on packet header information, including L2 and L3 layerheader information. A packet might be received on one PFE and go backout to the network on the same PFE, or be sent through switch fabric 120to be sent out to the network on a different PFE.

FIG. 2 is an exemplary detailed block diagram illustrating portions ofrouting system 100. PFEs 110 connect to one another through switchfabric 120. Each of the PFEs may include one or more physical interfacecards (PICs) 210 and flexible port concentrators (FPCs) 220.

PIC 210 may transmit data between a physical link and FPC 220. DifferentPICs are designed to handle different types of physical links. Forexample, one of PICs 210 may be an interface for an optical link whileanother PIC may be an interface for an Ethernet link.

FPCs 220 perform routing functions and handle packet transfers to andfrom PICs 210 and switch fabric 120. For each packet it handles, an FPCperforms the previously-discussed route lookup function. Although FIG. 2shows two of PICs 210 connected to each of FPCs 220 and three FPCs 220connected to switch fabric 120, in other embodiments consistent withprinciples of the invention there can be more or fewer PICs 210 and FPCs220.

FIG. 3 is an exemplary configuration of one of FPCs 220 according to animplementation consistent with the principles of the invention. Each FPCmay include processing units 332 and 334, first input/output (I/O) unit336, second I/O unit 338, memory unit 340, and R unit 342. Eachprocessing unit 332 and 334 corresponds to one or more of PICs 210.

As will be described in greater detail below, processing units 332 and334 may process packet data flowing between PICs 210 and first I/O unit336. Each processing unit 332 and 334 may process packet data receivedfrom the PIC connected to it, and data received from first I/O unit 336.

For example, processing unit 332 or 334 may process packets from PIC 210to convert the packets into data cells, and transmit the data cells tofirst I/O unit 336. Data cells are the data structure used by FPC 220internally for transporting and storing data. In one implementation,data cells are 64 bytes in length.

In the other direction, processing unit 332 or 334 receives data cellsand notifications from first I/O unit 336, extracts certain informationand packet data from the data cells, and creates a packet based on theextracted information. Processing unit 332 or 334 creates the packetheader based on the information extracted from the data cells. In oneembodiment, processing unit 332 or 334 creates L2 and L3 headerinformation based on the extracted information. The created L2 and L3header information constitutes a new header that the packet uses as itis subsequently transmitted through the physical link.

R unit 342 may receive notifications from first I/O unit 336 and secondI/O unit 338. R unit 342 may provide route lookup, accounting, andpolicing functionality based on the notifications. R unit 342 mayreceive one or more forwarding tables from RE 130 (FIG. 1) and use thekeys, forwarding table(s), and encapsulation tables to perform route orencapsulation lookups. R unit 342 may insert the lookup result into anotification, which it may store in memory unit 340.

Memory unit 340 may temporarily store data cells from first I/O unit 336and second I/O unit 338 and notifications from R unit 342. Memory 340may dispatch the notifications to first I/O unit 336 and second I/O unit338. In response, first I/O unit 336 and second I/O unit 338 may use theaddress information in the notification to read out data cells frommemory unit 340 that correspond to a notification. The notificationreceived from memory unit 340 may have been modified by R unit 342 withroute or encapsulation lookup results. First I/O unit 336 and second I/Ounit 338 may update the data cells read out of memory unit 340 withinformation from the modified notification. The data cells, which nowinclude information from the modified notification, are sent toprocessing unit 332, processing unit 334, or switch fabric 120,depending on which of first I/O unit 336 or second I/O unit 338 isprocessing the notification.

Creation of L2 and L3 Header Information

As previously mentioned, processing units 332 and 334, when receivingcells form first I/O unit 336, may create new packet L2 and L3 headerinformation before sending the packet to PIC 210 for eventualtransmission to the physical links. FIG. 4 illustrates possible changesmade to a packet by processing units 332 and 334.

Packet 401, when received by processing unit 332 or 334 from first I/Ounit 336, may include “old” MPLS (multi-protocol label switching) tags402 (optional), an “old” L3 header field 403 (i.e., the L3 headerassociated with the packet as originally received by router 100), andthe payload 404 of the packet. At this point, the original L2 headerreceived with the packet has previously been stripped from the packet byprocessing units 332/334. Accordingly, no old L2 header information isshown associated with packet 401. MPLS involves setting a specific pathfor a given sequence of packets, identified by a label in the MPLS tagfield.

Processing unit 332 or 334 processes packet 401 and generates a modifiedversion of the packet, labeled as packet 405. Packet 405 includes newlygenerated L2 header field 406, new MPLS tags 407 (optional), new L3header field 408, and payload 404. New MPLS tags 407 and L3 header field408 may contain new information, although, in certain cases, theinformation may be the same as old MPLS tags 402 and old L3 field 403.

As is also illustrated in FIG. 4, old L3 header field 403 and old MPLStags 402 are contained within the first two cells of a packet. A portionof the payload 404 may also be contained in the first two cells. Inalternate implementations, header field 403 and old MPLS tags 402 may becontained in more or less than the first two cells of the packet. Theparticular mapping of packet information to cells may vary in otherimplementations consistent with the principles of the present invention.

FIG. 5 illustrates elements of processing units 332/334 as they relateto generation of the L2/L3 header information in fields 406-408. Asshown, processing unit 332/334 may include an input interface component501 connected to a buffer 502 and descriptor reader component 503.Descriptor reader component 503 transmits information to L2/L3 enginecomponent 504, which generates the new L2/L3 header information offields 406-408 and forwards the generated information to outputinterface 505.

In operation, packet data from first I/O unit 336 is received by inputinterface component 501 as a series of cells. Input interface component501 checks the received data for errors, and if the packet data isacceptable, stores the packet data to buffer 502. Buffer 502 may beimplemented as a series of logical queues 520 a-520 d (collectively“520”), in which each of queues 520 may correspond to a series of cellsfor a packet stream. Input interface component 501 monitors the cellsstored in queues 520, and when enough cells are present in a queue tostart header processing, interface component 501 transfers up to thefirst two cells (i.e., the cells containing the packet headerinformation) in the queue to descriptor reader component 503. Descriptorreader component 503 may access external SRAM 510 before forwarding thetwo cells, along with information retrieved from SRAM 510, to L2/L3engine component 504. SRAM 510 may store descriptor information requiredby L2/L3 engine component 504 in generating the new L2/L3 headerinformation. Through SRAM 510, additional control information or datafor the new L2/L3 header information can be associated with the packet.

L2/L3 engine component 504 generates the new L2/L3 header informationfor a packet, such as the information in fields 406, 407, and 408 (FIG.4). The operation of L2/L3 engine component 504 will be described inmore detail below.

Output interface component 505 receives the new header information fromL2/L3 engine component 504 and the corresponding remaining payload forthe packet from buffer 502. Output interface 505 may then assemble thepacket, such as packet 405 (FIG. 4), using the received header andpayload.

In certain circumstances (e.g., handling packet fragmentation), L2/L3engine component 504 may send the new L2/L3 header information for apacket to input interface component 501 and to output interfacecomponent 505. One instance of such header “recycling” is describedbelow with reference to FIG. 16. In typical circumstances, however, thenew L2/L3 header information is sent to output interface component 505.

L2/L3 Engine Component

As previously mentioned, the L2/L3 engine component 504 generates the L2and L3 header information for a packet. To increase bandwidth, multipleL2/L3 engines may be implemented in parallel within the L2/L3 enginecomponent 504. FIG. 6 is a diagram illustrating an embodiment of theL2/L3 engine component 504 having six parallel L2/L3 engines 602. Inother implementations, more or less than six engines 602 may be used.Dispatch component 601 directs incoming packet header information to oneof L2/L3 engines 602. Dispatch component 601 may function to evenlydistribute the incoming packet header information to the L2/L3 engines602 such that total bandwidth through the engines is maximized.

Header FIFO component 603 receives the processed L2/L3 packet headerinformation generated by L2/L3 engines 602 and queues the processedheader for transmission to output interface component 505 (FIG. 5).Before transmitting the header information, header FIFO component 603may first tell the output interface 505 the size of the header and thesize of the remaining data in data buffer 502. In response, outputinterface 505 may start to read the remaining data from data buffer 502.

In one implementation, header FIFO component 603 ensures that thepackets it is about to transmit are in the sequence in which the packetsof a data flow were received. Ordering may be ensured by unit 502, priorto dispatching a packet to the descriptor reader 503 and eventuallyL2/L3 engine component 504, reserves a space in the header FIFO 603.Because packets are dispatched in order by unit 502, the space allocatedis also in order in the header FIFO component 603. Even when packetsreach header FIFO component 603 at different times, the packets will bestored in the header FIFO 603 in the order they are dispatched, and thuswill be transmitted in order.

FIG. 7 is a diagram illustrating an embodiment of one of L2/L3 engines602 consistent with the principles of the invention. In engine 602, theportion of the L2/L3 engine 602 that generates the L2 header informationmay be implemented in parallel with the portion of the L2/L3 engine thatgenerates the L3 header information. In this manner, the L2 headerinformation can be generated simultaneously with the L3 headerinformation. More specifically, L2 execution unit 701 and L3 executionunit 703 are implemented in parallel with one another. The L2 executionunit 701 is responsible for building the L2 header information. In oneimplementation, L2 execution unit 701 is implemented as a singleprocessing unit that processes one instruction each clock cycle. The L3execution unit 703 is responsible for building the L3 headerinformation. The L3 execution unit 703 may be constructed as threeparallel processing units.

L2 execution unit 701 operates on input packet header information byexecuting instructions stored in instruction memory 702. Dispatchcomponent 601 writes the input packet header information to memory 713by storing cells including packet header information in memory 713. Inoperation, L2 execution unit 701 retrieves the header data from memory713 and generates the new L2 header information based on execution ofthe instructions stored in instruction memory 702. When calculating thenew L2 header information, L2 execution unit 701 may additionally readfrom or write to template memory 710, tag descriptor memory 711, and L2descriptor memory 712. Template memory 710 may store on-chip templatedata for a packet. Such template data may be common to differentheaders, and may be initially stored on-chip in a memory (not shown).Tag descriptor memory 711 and L2 descriptor memory 712 may include thedescriptor information read by descriptor reader 503 from SRAM 510.

L3 execution unit 703 may execute instructions stored in instructionmemory 704. In a manner similar to L2 execution unit 701, L3 executionunit 703 retrieves the header information for a packet from memory 713and generates the new L3 header information based on execution of theinstructions stored in instruction memory 704.

Buffers 720 and 721 store the header information generated by theexecution units. More specifically, as L2 execution unit 701 generatesthe L2 header information, it may write it into buffer 720. Similarly,as L3 execution unit 702 generates the L3 header information, it writesthe information into buffer 721.

Build component 740 assembles the L2 and L3 header information from L2output buffer 720 and L3 output buffer 721.

Registers 730 and 735 are storage registers useable by L2 execution 701and L3 execution 703. In one implementation, registers 730 are each32-bit general purpose storage registers and registers 735 are 32-bitmailbox registers. There may be, for example, sixteen general purposestorage registers 730 and eight mailbox registers 735. The mailboxregisters 735 allow execution units 701 and 702 to exchange informationwith one another. The mailbox registers 735 may be pre-designated suchthat only certain resources can write to a particular one of the mailboxregisters while only certain other resources can read from theparticular mailbox register. Thus, for example, only the L2 executionunit 701 may be allowed to write to the first mailbox register and onlyL3 execution unit 703 may be allowed to read from this mailbox register.

Operation of L2/L3 Execution Units 701 and 703 with their Output Buffers720 and 721

The operation of execution units 701 and 703 when interacting withoutput buffers 720 and 721 will next be described. Input packet headerdata stored in memory 713 is read by L2 execution unit 701 and L3execution unit 703, as required by these units. Periodically, L2execution unit 701 writes to buffer 720. Similarly, L3 execution unit703 periodically generates writes to buffer 721. These write operationsto buffers 720 and 721 are not time correlated with one another.Eventually, L2 execution unit 701 and L3 execution unit 703 each finishwriting to their respective output buffers 720 and 721. Typically, L2execution unit 701 and L3 execution unit 703 finish writing to outputbuffers 720 and 721 at different times. When both have finished writingto their output buffers, build component 740 combines the results ofboth buffers to form the complete header for the packet.

As shown in FIG. 4, the final packet header generated by outputinterface 505 includes L2 header fields 406 and 407 followed by the L3header field 408. By independently buffering the L2 header data and L3header data, and then combining the L2 and L3 header data, L2 executionunit 701 and L3 execution unit 703 are able to operate in parallel. Thisis advantageous, as it allows for more efficient generation of a packetheader relative to a serial implementation that first generates L2header information and then generates L3 header information.

FIG. 8 is a flow chart illustrating operation of L2/L3 engines 602consistent with principles of the invention. To begin, received packetheader data is accessed by L2 execution unit 701 and L3 execution unit703 (acts 801, 802, 803). L2 execution unit 701 and L3 execution unit703 independently operate on the received packet header. Duringoperation, L2 execution unit 701 may write new L2 packet header data tobuffer 720 (act 804) and L3 execution unit 703 may write new L3 packetheader data to buffer 721 (act 805). When the L2 execution unit finisheswriting the L2 packet data to buffer 720, it signals its completion tobuild component 740. The L3 execution unit similarly signals itscompletion of writing the L3 packet data to buffer 721 (acts 807 and809). Finally, build component 740, in response to the signalsindicating completion of the L2 and L3 header data, loads the L2 packetheader from buffer 720, loads the L3 packet header from buffer 721,loads any remaining packet data from memory 713, and builds the completepacket header (act 810).

Input/Output of Data in L2/L3 Engines 602

As discussed above, L2/L3 engines 602 receive old packet header datafrom dispatch component 601, generate the new packet header data, andtransmit the new packet header data to build component 740 from buffers720 and 721. In this manner, each of the L2/L3 engines operate on asingle packet at any given time. Consistent with an aspect of theinvention, L2/L3 engines 602 may increase the efficiency with which theyload and unload packets by simultaneously loading header data for a nextpacket while unloading the packet header data that was most recentlygenerated.

FIG. 9 is a diagram conceptually illustrating the loading and unloadingof data in the L2/L3 engines 602. Packet header data for a first packetis received from dispatch component 601 and loaded into packet headermemory 713. Dispatch component 601 may also transmit data to on-chiptemplate memory 710, tag descriptor memory 711, and/or L2 descriptormemory 712. Additionally, dispatch component may preload general purposeregisters 730 with information such as, for example, packet lengthinformation, fragmentation information for the packet, or informationrelating to the MPLS tags. This loaded information is then processed bythe L2 execution unit 701 and L3 execution unit 703, as discussed above.

When both the L2 execution unit 701 and the L3 execution unit 703 havefinished writing the new packet header data to buffers 720 and 721,build component 740 unloads the buffers by reading the new packet headerdata from the buffers. Simultaneously, dispatch component may begin totransit data associated with the next packet into memories 710-713. Inthis manner, processing of the next packet by L2/L3 engine 602 can beginsooner than if the L2/L3 engine waited until a packet was fully removedfrom the L2/L3 engine before beginning processing on the next packet.

Mailbox Registers

As shown in FIG. 7, the L2/L3 engines 602 include general purposestorage registers 730 and mailbox registers 735. Mailbox registers 735allow execution units 701 and 702 to exchange information with oneanother and with external devices, such as an external host computer(not shown).

FIG. 10 is a diagram illustrating an implementation of the mailboxregisters 735 consistent with the principles of the invention. Both L2execution unit 701 and L3 execution unit 703 can write and read from anyof general purpose registers 730. Mailbox registers 735, however, areeach “one-way” registers that are designed to be written to by a singleresource and read from by another resource. Specifically, as shown inthe exemplary implementation of FIG. 11, three mailbox registers 1001are used to transfer information from L3 execution unit 703 to L2execution unit 701, one mailbox register 1002 is used to transferinformation from L2 execution unit 701 to L3 execution unit 703, onemailbox register 1003 is used to transfer information from L2 executionunit 701 to host processor 1007, one mailbox register 1004 is used totransfer information from host processor 1007 to L2 execution unit 701,one mailbox register 1005 is used to transfer information from L3execution unit 703 to host processor 1007, and one mailbox register 1006is used to transfer information from host processor 1007 to L3 executionunit 703. Host processor 1007 may be, for example, a processor used inprogramming and debugging L2/L3 engines 602.

In one implementation, each of mailbox registers 1001-1007 is a 32-bitregister associated with an additional valid (“V”) bit. The valid bitsinform the resources associated with the mailbox (i.e., the L2 executionunit, the L3 execution unit, and the host processor) whether the mailboxis waiting to be read or is available to be written. Thus, for example,when the L2 execution unit 701 wishes to write to mailbox register 1002,it first checks the state of the valid bit. If the valid bit is not set(i.e., it is a logic zero), L2 execution unit 701 writes its data tomailbox register 1002 and sets the valid bit. If, however, the valid bitis set (i.e., it is a logic one), the L2 execution unit waits until theL3 execution unit 703 resets the valid bit before writing to mailboxregister 1002. Correspondingly, L3 execution unit 703 waits until thevalid bit is set before reading from mailbox register 1002. Afterreading the mailbox register, L3 execution unit 703 resets the validbit.

Although the above description of mailbox registers 1001-1006 included acertain number of mailbox registers 1001-1006, one of ordinary skill inthe art will recognize that more or less mailbox registers 1001-1006could be used for each set of mailbox registers 1001-1006.

Detailed Description of L2 and L3 Execution Units

FIGS. 11 and 12 are diagrams illustrating, in additional detail, L2execution unit 701 and L3 execution unit 703, respectively, inaccordance with concepts consistent with the invention.

As previously mentioned, L2 execution unit 701 receives instructionsfrom instruction memory 702. Instruction memory 702 may be a 64-bit widememory. The particular instruction to retrieve from instruction memory702 is determined by the value in program counter 1102. The selectedinstruction is received by execution section 1103. Execution section1103 may be implemented as a two-stage pipeline. Stack 1101 is a singleentry memory that may be used to temporarily store, for example, anincremented version of the value in program counter 1102.

Referring to FIG. 12, L3 execution unit 703 is constructed similarly toL2 execution unit 701, except that in addition to a single stack 1201and a single program counter 1202, L3 execution unit 703 contains threeparallel execution sections 1203, 1204, and 1205. Each execution section1203-1205 simultaneously receives an instruction from instruction memory704. Instruction memory 704 may be a 192-bit wide memory. Each 192-bitword read from instruction memory 704 is divided equally betweenexecution sections 1203-1205 as three 64-bit instructions.

Although there are three execution sections 1203-1205 in L3 executionunit 703, only one of the execution sections, execution section 1203, isconnected to program counter 1202. Thus, only execution section 1203controls the program flow.

Execution sections 1203-1205 may communicate with one another throughthe general purpose registers 735. Generally, however, instructions arestored in memory 704 that allow execution sections 1203-1205 to functionlargely independently of one another. For example, one of the executionsections may work on computing a checksum while another of the executionsections computes a packet length.

Logical Separation and Accessing of Descriptor Memories 710, 711, and712

As previously discussed, L2 execution unit 701 may read from or write totemplate memory 710, tag descriptor memory 711, and descriptor memory712 when calculating new L2 header information. One implementation ofmemories 710-712 consistent with the principles of the invention isthree separate first-in, first-out (FIFO) buffers. Different registers,for example, would be used in conjunction with the buffers to keep trackof data within the FIFO buffers. Such an implementation, however,entails a significant delay for L2 execution unit 701 to obtain datafrom the memories 710-712.

FIG. 13 is a diagram illustrating the memories 710, 711, and 712 of FIG.7 in additional detail in an implementation consistent with theprinciples of the invention. A single descriptor memory 1310 may includetemplate memory 710, tag descriptor memory 711, and L2 descriptor memory712. In other words, template memory 710, tag descriptor memory 711, andL2 descriptor memory 712 may be logical portions of descriptor memory1310, rather than separate physical memories. In one implementation,descriptor memory 1310 may be 40 bytes in size, and may be configured toprovide data from any memory location addressed (e.g., random access).

Template memory 710 may store on-chip template data for a packet, andmay begin at address 0 of descriptor memory 1310. Such template data maybe common to different headers, and may be loaded into template memory710 from an on-chip memory (not shown). Tag descriptor memory 711 maystore tag descriptor data for MPLS tags from SRAM 510, and may begin atan address of descriptor memory 1310 that is determined by the size ofthe on-chip template data in template memory 710.

In one implementation, L2 descriptor memory 712 may include the L2descriptor information read from SRAM 510, and may begin at an addressof descriptor memory 1310 that is determined by the size of both theon-chip template data in template memory 710 and the tag descriptor datain tag descriptor memory 711. Data may be respectively written totemplate memory 710, tag descriptor memory 711, and L2 descriptor memory712 by dispatch component 601 in a known order. In otherimplementations, descriptor memory 712 may include descriptorinformation from a level x (Lx) protocol, where x may indicate one ofseveral protocols (e.g., L2, L3, etc.). Hence, descriptor memory 712 maybe referred to generically as an “Lx descriptor memory” 712.

Current locations within template memory 710, tag descriptor memory 711,and L2 descriptor memory 712 may be respectively designated by atemplate pointer, a tag pointer, and an L2 pointer, all of whichinitially point to the beginning addresses of their respective memories.Certain details of the order in which L2 execution unit 701 reads frommemories 710-712 may be specified by different instruction sequencesselected by the L2 protocol (e.g., 802.3, SNAP, or PPP) of the packetwhose L2 header is being processed. When data is read from, for example,template memory 710, the template pointer may be incremented by one ormore addresses, determined by the number of bytes read, to simulatereading from a FIFO buffer. In the implementation shown in FIG. 13, L2execution unit 701 need store only three pointers in logic, and mayretrieve data from memories 710-712 more efficiently than from separateFIFO buffers. Further, data may be alternately read from memories710-712 by switching from one of the respective pointers to another.Because of the ability to rapidly obtain data from memories 710-712, L2execution unit 701 may process L2 headers more quickly.

On the Fly L3 Header Checksum Processing

In certain internet protocols, internet protocol version 4 (IPv4) forexample, L3 header 408 that is generated L3 execution unit 703 maycontain a checksum. The checksum may be used to detect corruption in areceived packet. For example, the checksum for IPv4 may be 16 bits andmay be contained within L3 header at a known location. As explainedabove, L3 execution unit 702 generates L3 header information and writesthe information into L3 output buffer 721. Typically, the L3 headerinformation is written to L3 output buffer 721 sequentially, with thechecksum information being initially written as zeros. One way togenerate the checksum would be for L3 execution unit 702 to wait untilL3 output buffer 721 contains an entire L3 header, read the entireheader, compute the checksum, and write the checksum to the appropriateposition in L3 output buffer 721. Such checksum computation, however,would occupy L3 execution unit 702 for a large number of instructioncycles, thereby delaying further L3 header processing.

FIG. 14 is a diagram illustrating checksum processing element 1400 andits relation to L3 execution unit 703. Checksum processing element 1400may be situated in the data flow between L3 execution unit 703 and L3output buffer 721, as shown in FIG. 14. Checksum processing element 1400may include a checksum generator 1410 and a checksum accumulator 1420.One of the general purpose registers 730 described in FIG. 7 may be usedas checksum accumulator 1420.

Checksum generator 1410 may include logic configured to compute achecksum using inputs of L3 information from L3 execution unit 703 andchecksum data from checksum accumulator 1420 when instructed by the L3execution unit 703. In some implementations, such an instruction may beimplicit (i.e., the checksum may be computed by default). In oneimplementation, L3 execution unit 703 may initially load checksumaccumulator 1420 with an initial value when it writes the first L3information for a new L3 header to L3 output buffer 721. In anotherimplementation consistent with the present invention, L3 execution unit703 may pre-load checksum accumulator 1420 with a value before it writesthe first L3 information for a new L3 header to L3 output buffer 721. Insubsequent writings of L3 information to L3 output buffer 721, checksumgenerator 1410 may read stored checksum data from checksum accumulator1420 and compute a new checksum using the stored checksum data and theL3 information being written to L3 output buffer 721. Checksum generator1410 may store this new (partial) checksum in checksum accumulator 1420.In this manner, checksum processing element 1400 updates the L3 checksum“on the fly” (i.e., concurrently) as the L3 header information iswritten to L3 output buffer 721 by L3 execution unit 703.

When L3 output buffer 721 contains an entire L3 header, checksumaccumulator 1420 contains the checksum for that L3 header. L3 executionunit 703 may write the checksum from checksum accumulator 1420 to theappropriate address in L3 output buffer 721. Because of the checksumprocessing element 1400, L3 execution unit 703 may use only twoinstruction cycles for checksum processing: one instruction cycle toinitially load checksum accumulator 1420, and one instruction cycle towrite the complete checksum from checksum accumulator 1420 to L3 outputbuffer 721. Because of the ability to concurrently compute the L3 headerchecksum, L3 execution unit 703 may process L3 headers more quickly.Although described with respect to L3 headers, it is specificallyenvisioned that checksum processing elements similar to checksumprocessing element 1400 may be used to compute other checksums on thefly as well.

Fragment Handling

Physical links with certain interface types, such as SONET, Ethernet,ATM, etc., have associated limits on the maximum packet size supportedby the interface type. These limits may be referred to as the “maximumtransfer unit” (MTU) of the interface. For example, standard Ethernethas an MTU of about 1500 bytes, while other interface types may have,for example, MTUs around 9000 bytes. If the size of a packet exceeds thesize of the MTU of its destination interface, the packet may befragmented (i.e., broken up into two or more pieces) so that it may betransmitted over the interface. Internet protocols (e.g., IPv4) maydefine protocols for handling fragmentation.

FIG. 15 is a flow chart illustrating fragment handling by the L2/L3engine component 504. L2/L3 engine component 504 may receive the firsttwo cells of a packet, which contain the packet header information, fromdescriptor reader 503 [act 1510]. The header information may include thelength of the packet. Alternately, the packet length may be detectedfrom the packet itself. The header information may also be used toobtain the MTU size of the interface that is the packet's destination.For example, the header information may be used to construct a key,which may be used to look up MTU information from SRAM 510. L2/L3 enginecomponent 504 may determine whether the length of the packet associatedwith the header information exceeds the MTU size of the destinationinterface [act 1520].

If the length of the packet is less than the MTU size of the destinationinterface, L2/L3 engine component 504 may generate a new header for thepacket, and may transmit the new header to output interface component505 [act 1530]. Output interface component 505 may assemble the newheader information and packet data from buffer 502 into a packet.

If the length of the packet is greater than the MTU size of thedestination interface, L2/L3 engine component 504 may generate a firstfragment header and send a first fragment with the header [act 1540].The first fragment header may include the size of any payload data inthe first two cells and the size of the packet data to be read frombuffer 502. This size information may be used to calculate an updatedpacket length. The updated packet length may be calculated by L2/L3engine component 504 and included in the first fragment header.Alternately, the updated packet length may not be included in the firstfragment header, but may be calculated from information in the firstfragment header in later processing (e.g., act 1560). The first fragmentheader also may include recycle information, such as a bit indicatingprevious fragmentation and a length of the L2 header.

The first fragment header may be transmitted to output interfacecomponent 505 for generation of a first packet fragment, and may also betransmitted to input interface component 501 [act 1550]. Outputinterface component 505 may assemble the first fragment headerinformation and packet data from buffer 502 into a first packet.Meanwhile, input interface component may send the first fragment header,via the descriptor reader 530, to L2/L3 engine component 504.

L2/L3 engine component 504 may use the first fragment header to generateone or more subsequent fragment headers by determining whether theupdated packet length (either contained in the first fragment header orcalculated) exceeds the MTU size of the destination interface [act1560]. If the updated packet length is less than the MTU size of thedestination interface, L2/L3 engine component 504 may generate a newheader for the packet, and may transmit the new header to outputinterface component 505 [act 1570]. Output interface component 505 mayassemble the new header information and packet data from buffer 502 intoa second packet fragment.

If the updated packet length is greater than the MTU size of thedestination interface, L2/L3 engine component 504 may generate a nextfragment header [act 1580]. The next fragment header may include thesize of the packet data to be read from buffer 502. This sizeinformation may be used to calculate an updated packet length. Theupdated packet length may be calculated by L2/L3 engine component 504and included in the first fragment header. Alternately, the updatedpacket length may not be included in the next fragment header, but maybe calculated from information in the first fragment header in laterprocessing (e.g., act 1560). The next fragment header also may includerecycle information, such as a bit indicating previous fragmentation anda length of the L2 header.

The next fragment header (and any subsequent fragment headers) may betransmitted to output interface component 505 and input interfacecomponent 501, and may be processed as described in acts 1550-1580. Inthis manner, L2/L3 engine component 504 may recycle packet headers whenthe packet's destination interface requires that the packet befragmented.

CONCLUSION

As described above, an L2 engine may include pointers to efficientlyread descriptor data from a single descriptor memory divided into anumber of logical portions. The L3 engine may have dedicated hardwareassociated with it to generate and update a checksum for the L3 headerwhen data is written to the L3 output buffer. Also, the L2/L3 engine mayrecycle packet headers when the packet's destination interface requiresthat the packet be fragmented. In this manner, an efficient L2/L3generation engine is achieved.

The foregoing description of preferred embodiments of the inventionprovides illustration and description, but is not intended to beexhaustive or to limit the invention to the precise form disclosed.Modifications and variations are possible in light of the aboveteachings or may be acquired from practice of the invention. Moreover,while a series of acts has been presented with respect to FIGS. 9 and15, the order of the acts may be different in other implementationsconsistent with principles of the invention. Additionally, lines witharrows are used in the figures to generally illustrate the flow of data.In practice, embodiments consistent with the principles of the inventionmay send data on these lines in both directions.

PFEs 110 may be implemented in hardware, software, or some combinationthereof. For example, various portions of PFEs 110 may be implemented inapplication-specific integrated circuits (ASICs). The ASICs may beconfigured to perform some processing via dedicated logic, and may alsobe configured to perform some processing using microcode instructionsthat may be stored in memory. Those skilled in the router art willappreciate that the invention described herein might be practiced usinga variety of hardware configurations in addition to, or instead of,ASICs. For example, some combination of general purpose processors,digital signal processors (DSPs), and programmable gate arrays (PGAs)may also be utilized to implement the functionality described herein.

No element, act, or instruction used in the description of the presentapplication should be construed as critical or essential to theinvention unless explicitly described as such. Also, as used herein, thearticle “a” is intended to include one or more items. Where only oneitem is intended, the term “one” or similar language is used.

The scope of the invention is defined by the claims and theirequivalents.

1-27. (canceled)
 28. A device comprising: a plurality of data unitprocessing components, each of the plurality of data unit processingcomponents, including: a higher layer execution unit to: receive headerinformation, where the header information includes template data and tagdescriptor data, and process the header information to obtain higherlayer header data, the higher layer execution unit performing theprocessing of the received header information in parallel withprocessing of the header information by a lower layer execution unitassociated with the one of the plurality of data unit processingcomponents.
 29. The device of claim 28, where the header informationfurther includes header data associated with a previously processed dataunit
 30. The device of claim 28, further comprising: a plurality ofmailbox registers to: store information to allow the higher layerexecution unit, of the one of the plurality of data unit processingcomponents, to share data with the lower layer execution unit,associated with the one of the plurality of data unit processingcomponents.
 31. The device of claim 30, where at least one mailboxregister, of the plurality of mailbox registers, accepts data from thehigher layer execution unit and does not accept data from the lowerlayer execution unit.
 32. The device of claim 30, where at least onemailbox register, of the plurality of mailbox registers, includes avalidity bit that indicates whether the one mailbox register is ready tobe written or read.
 33. The device of claim 28, further comprising: abuild component to: receive the higher layer header data from the higherlayer execution unit, and form a header based on the higher layer headerdata and the lower layer header data received from the lower layerexecution unit.
 34. The device of claim 28, where a data unit processingcomponent, of the plurality of data unit processing components, loadsinformation relating to a first header simultaneously with acquiringinformation relating to a second header.
 35. The device of claim 28,where the higher layer execution unit includes a plurality of executionsections, including: a first execution section, of the plurality ofexecution sections, to process the header information, and a secondexecution section, of the plurality of execution sections, to compute achecksum.
 36. The device of claim 28 further comprising: a dispatchcomponent to: receive the header information associated with a dataunit; parse the received header information, and to direct the parsedheader information to two or more of the plurality of data unitprocessing components.
 37. A device comprising: input unit to: receive adata unit, and determine header information associated with the dataunit, where the header information includes template data and tagdescriptor data; a higher layer execution unit to: receive the headerinformation, and generate higher layer header data based on the headerinformation, the higher layer execution unit generating the higher layerheader data in parallel with generation of lower layer header data,associated with the header information, by an associated lower layerexecution unit.
 38. The device of claim 37, further comprising: adispatch component to: parse the header information to create parsedheader information portions, and direct one of the parsed headerinformation portions to the higher layer execution unit.
 39. The deviceof claim 37, further comprising: at least one mailbox register to storeinformation, the at least one mailbox register allowing the higher layerexecution unit to share data with the lower layer execution unit. 40.The device of claim 39, where the at least one mailbox register includesa first mailbox register and a second mailbox register, where the firstmailbox register cannot be written to by the higher layer executionunit, and where the second mailbox register cannot be written to by thelower layer execution unit.
 41. The device of claim 39, where the atleast one mailbox register includes a validity bit that indicateswhether data associated with the at least one mailbox register is readyto be written or read.
 42. The device of claim 37, further comprising: abuild component to combine the higher layer header data and the lowerlayer header data to form a header.
 43. The device of claim 37, wherethe higher layer execution unit is further to compute a checksum for thereceived header information.
 44. A method implemented in a devicecomprising a plurality of data unit processing components, the methodcomprising: receiving, at a higher layer execution unit in one of the aplurality of data unit processing components, header informationincluding at least one of template data, tag descriptor data, or higherlayer descriptor data; generating, at the higher layer execution unit,higher layer header data based on the header information, wheregenerating the higher layer header data occurring in parallel withgenerating, by one of the plurality of data unit processing components,lower layer header data associated with the header information; andforming, based on the higher layer header data and the lower layerheader data, a header.
 45. The method of claim 44, further comprising:transferring data to and from the higher layer execution unit using afirst mailbox register.
 46. The method of claim 44, further comprising:transferring data to and from the lower layer execution unit using asecond, different mailbox register that cannot be accessed by the higherlayer execution unit.
 47. The method of claim 44, further comprising,computing a checksum for the header information, and verifying theheader information based on the checksum.